-
1 degree of unsolvability
The English-Russian dictionary general scientific > degree of unsolvability
-
2 degree of unsolvability
Большой англо-русский и русско-английский словарь > degree of unsolvability
-
3 degree of unsolvability
Вычислительная техника: степень неразрешимостиУниверсальный англо-русский словарь > degree of unsolvability
-
4 degree of unsolvability
English-Russian dictionary of computer science and programming > degree of unsolvability
-
5 degree of unsolvability
English-Russian scientific dictionary > degree of unsolvability
-
6 degree of unsolvability
-
7 degree of unsolvability
English-Russian information technology > degree of unsolvability
-
8 degree of unsolvability
Англо-русский словарь по исследованиям и ноу-хау > degree of unsolvability
-
9 the degree of unsolvability
Математика: степень неразрешимостиУниверсальный англо-русский словарь > the degree of unsolvability
-
10 unsolvability
The English-Russian dictionary general scientific > unsolvability
-
11 degree
1) градус2) матем. степень; порядок3) сорт, качество4) диплом5) степень, уровень; ступень•degrees to port — мор. градусы левого борта
degrees to starboard — мор. градусы правого борта
to some degree — до некоторой степени; в известной мере
-
12 degree
1) степень2) порядок3) градус•- degree of curvature
- degree of differential equation
- degree of freedom
- degree of ill-posedness
- degree of polynomial
- degree of reduction
- degree of uncertainty
- degree of unsolvability
- degree of vertexEnglish-Russian dictionary of computer science and programming > degree
-
13 recursive unsolvability
-
14 recursive unsolvability
The English-Russian dictionary general scientific > recursive unsolvability
-
15 степень неразрешимости
Большой англо-русский и русско-английский словарь > степень неразрешимости
См. также в других словарях:
Turing degree — Post s problem redirects here. For the other Post s problem , see Post s correspondence problem. In computer science and mathematical logic the Turing degree or degree of unsolvability of a set of natural numbers measures the level of algorithmic … Wikipedia
PA degree — In recursion theory, a mathematical discipline, a PA degree is a Turing degree that computes a complete extension of Peano arithmetic (Jockusch 1987). These degrees are closely related to fixed point free (DNR) functions, and have been thoroughly … Wikipedia
Turing degree — noun Given a set of natural numbers, a measure of the level of algorithmic unsolvability of the set. See Also: Turing equivalent … Wiktionary
Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… … Wikipedia
Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown … Wikipedia
List of philosophy topics (D-H) — DDaDai Zhen Pierre d Ailly Jean Le Rond d Alembert John Damascene Damascius John of Damascus Peter Damian Danish philosophy Dante Alighieri Arthur Danto Arthur C. Danto Arthur Coleman Danto dao Daodejing Daoism Daoist philosophy Charles Darwin… … Wikipedia
Halting problem — In computability theory, the halting problem can be stated as follows: Given a description of a computer program, decide whether the program finishes running or continues to run forever. This is equivalent to the problem of deciding, given a… … Wikipedia
Hilbert's tenth problem — is the tenth on the list of Hilbert s problems of 1900. Its statement is as follows:Given a Diophantine equation with any number of unknown quantities and with rational integral numerical coefficients: To devise a process according to which it… … Wikipedia
Mathematical logic — (also known as symbolic logic) is a subfield of mathematics with close connections to foundations of mathematics, theoretical computer science and philosophical logic.[1] The field includes both the mathematical study of logic and the… … Wikipedia
metalogic — /met euh loj ik/, n. the logical analysis of the fundamental concepts of logic. [1835 45; META + LOGIC] * * * Study of the syntax and the semantics of formal languages and formal systems. It is related to, but does not include, the formal… … Universalium
History of logic — Philosophy ( … Wikipedia